Datalog Automata
نویسنده
چکیده
We propose a new computational paradigm for the evaluation of recursive Datalog queries, which is based on a pushdown automaton (PDA) model. By extending to these automata a dynamic programming technique developed for PDAs in context-free parsing, we obtain a general and simple technique for constructing efficient polynomial query evaluators.
منابع مشابه
Rapport de stage de recherche Complexity of Decision Problems in Computational Logic RAPPORT NON CONFIDENTIEL
This report presents the study of algorithms whose goal is to determine whether two Datalog programs are equivalent. Datalog is a query language used over deductive databases. Datalog is a fragment of Prolog, and consists in Horn clauses without function symbols. In general, it is undecidable whether two given Datalog programs are equivalent one to each other; however, this problem becomes deci...
متن کاملCombined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version)
We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We introduce a new Datalog fragment with stratified negation, intensional-clique-guarded Datalog (ICG-Datalog), with linear-time evaluation on structures of bounded treewidth for programs of bounded rule size. Such programs capture in particular co...
متن کاملQuerying Unranked Trees with Stepwise Tree Automata
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata can express the same monadic queries as monadic Datalog and monadic second-order logic. We prove this result by reduction to the ranked case, via a new systematic correspondence that relates unranked and ranked queries.
متن کاملCombined Tractability of Query Evaluation via Tree Automata and Cycluits
We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We introduce a new Datalog fragment with stratified negation, intensional-clique-guarded Datalog (ICG-Datalog), with linear-time evaluation on structures of bounded treewidth for programs of bounded rule size. Such programs capture in particular co...
متن کاملDeciding Weak Monadic Second-order Logics using Complex-value Datalog
In this paper we propose to use techniques developed for query evaluation of Complex-value Datalog queries for determining satisfiability of WS1S and WS2S formulæ. This in turn can serve as a decision procedure for Description Logics for which embeddings into WS1S and WS2S have been proposed recently. We show that the use of database query evaluation techniques—in particular the Magic Set rewri...
متن کامل